Revisiting Prime Power RSA

Revisiting Prime Power RSA

Recently Sarkar (DCC 2014) has proposed a new attack on small decryption exponent when RSA Modulus is of the form N = pq for r ≥ 2. This variant is known as Prime Power RSA. The work of Sarkar improves the result of May (PKC 2004) when r ≤ 5. In this paper, we improve the existing results for r = 3, 4. We also study partial key exposure attack on Prime Power RSA. Our result improves the work of...

On the security of multi-prime RSA

In this work we collect the strongest known algebraic attacks on multi-prime RSA. These include factoring, small private exponent, small CRT exponent and partial key exposure attacks. Five of the attacks are new. A new variant of partial key exposure attacks is also introduced which applies only to multi-prime RSA with more than two primes.

Paris: a Parallel Rsa-prime Inspection Tool

PARIS: A PArallel RSA-prime InSpection tool

On Some Attacks on Multi-prime RSA

Factoring RSA Moduli with Weak Prime Factors

In this paper, we study the problem of factoring an RSA modulus N = pq in polynomial time, when p is a weak prime, that is, p can be expressed as ap = u0 + M1u1 + . . . + Mkuk for some k integers M1, . . . ,Mk and k+2 suitably small parameters a, u0, . . . uk. We further compute a lower bound for the set of weak moduli, that is, moduli made of at least one weak prime, in the interval [2, 2] and...